11296 - Counting Solutions of an Integer Equation/p11296.cpp

   1 #include <iostream>
   2 using namespace std;
   3 int main(){
   4   int n;
   5   while (cin >> n){
   6     long long s=0;
   7     if (n % 2 == 1) --n;
   8     while (n >= 0){
   9       s += (n/2)+1;
  10       n -= 2;
  11     }
  12     cout << s << endl;
  13   }
  14   return 0;
  15 }